Disjunctive programming for multiobjective discrete optimisation

In this paper, I view and present the multiobjective discrete optimisation problem as a particular case of disjunctive programming where one seeks to identify efficient solutions from within a disjunction formed by a set of systems. The proposed approach lends itself to a simple yet effective iterative algorithm that is able to yield the set of all nondominated points, both supported and nonsupported, for a multiobjective discrete optimisation problem. Each iteration of the algorithm is a series of feasibility checks and requires only one formulation to be solved to optimality that has the same number of integer variables as that of the single objective formulation of the problem. The application of the algorithm show that it is particularly effective, and superior to the state-of-the-art, when solving constrained multiobjective discrete optimisation problem instances

Thirty years of heterogeneous vehicle routing

It has been around thirty years since the heterogeneous vehicle routing problem was introduced, and significant progress has since been made on this problem and its variants. The aim of this survey paper is to classify and review the literature on heterogeneous vehicle routing problems. The paper also presents a comparative analysis of the metaheuristic algorithms that have been proposed for these problems

Optimised solutions to the last-mile delivery problem in London using a combination of walking and driving

Inspired by actual parcel delivery operations in London, this paper describes a two-echelon distribution system that combines the use of driving and walking as part of last-mile deliveries in urban areas for a single driver. The paper presents an optimisation model that explicitly treats and integrates the driving and walking elements, and describes a branch-and-cut algorithm that uses new valid inequalities specifically tailored for the problem at hand. Computational results based on real instances obtained from a courier operating in London are presented to show the performance of the algorithm

Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm

This paper studies the asymmetric Hamiltonian p-median problem, which consists of finding p mutually disjoint circuits of minimum total cost in a directed graph, such that each node of the graph is included in one of the circuits. Earlier formulations view the problem as the intersection of two subproblems, one requiring at most p, and the other requiring at least p circuits, in a feasible solution. This paper makes an explicit connection between the first subproblem and subtour elimination constraints of the traveling salesman problem, and between the second subproblem and the so-called path elimination constraints that arise in multi-depot/location-routing problems. A new formulation is described that builds on this connection, that uses the concept of an acting depot, resulting in a new set of constraints for the first subproblem, and a strong set of (path elimination) constraints for the second subproblem. The variables of the new model also allow for effective symmetry-breaking constraints to deal with two types of symmetries inherent in the problem. The paper describes a branch-and-cut algorithm that uses the new constraints, for which separation procedures are proposed. Theoretical and computational comparisons between the new formulation and an adaptation of an existing formulation originally proposed for the symmetric Hamiltonian p-median problem are presented. Computational results indicate that the algorithm is able to solve asymmetric instances with up to 171 nodes and symmetric instances with up to 100 nodes

Collaborative Parcels Logistics via the Carrier’s Carrier Operating Model

Parcel logistics in urban areas are characterized by many carriers undertaking similar activity patterns at the same times of day. Using substantial carrier manifest datasets, this paper demonstrates advantages from rival carriers collaborating using a “carrier’s carrier” operating model for their last-mile parcel logistics operations. Under these circumstances, a single carrier undertakes all the deliveries within a defined area on behalf of the carriers instead of them working independently. Modelling the daily delivery activity of five parcel carriers working over a 3.7 km2 area of central London, comprising around 3000 items being delivered to around 900 delivery locations, and consolidating their activity through a single carrier suggested that time, distance and associated vehicle emissions savings of around 60% could be achieved over the current business-as-usual operation. This equated to a reduction in the number of delivery vans and drivers needed from 33 to 13, with annual savings of 39,425 h, 176,324 km driven, 52,721 kg CO2 and 56.4 kg NOx. Reliance on vans and associated vehicle emissions could be reduced further by using cargo cycles alongside vans for the last-mile delivery, with estimated annual emissions savings increasing to 72,572 kg CO2 and 77.7 kg NOx. The results indicated that consolidation of items for delivery in this way would be especially beneficial to business-to-consumer (B2C) carriers whose parcel profiles comprise relatively small and light items. One of the key barriers to the wider take up of such services by individual carriers is the loss of individual brand identity that can result from operating through a carrier’s carrier

ICT for Sustainable Last-Mile Logistics: Data, People and Parcels

In this paper we present a vision of how ICT can be leveraged to help combat the impact on pollution, congestion and carbon emissions contributed by the parcel delivery sector. This is timely given annual growth in parcel deliveries, especially same-day deliveries, and the need to inform initiatives to clean up our cities such as the sales ban on new petrol and diesel vehicles in the UK by 2040. Our insights are informed by research on parcel logistics in Central London, leveraging a data set of parcel manifests spanning 6 months. To understand the impact of growing e-commerce trends on parcel deliveries we provide a mixed methods case study leveraging data-driven analysis and qualitative fieldwork to demonstrate how ICT can uncover the impact of parcel deliveries on delivery drivers and their delivery rounds during seasonal deliveries (or “the silly season”). We finish by discussing key opportunities for intervention and further research in ICT4S and co-created Smart Cities, connecting our findings with existing research and data as a call to the ICT4S community to help tackle the growth in carbon emissions, pollution and congestion linked to parcel deliveries

Optimising Parcel Deliveries in London Using Dual-Mode Routing

Last-mile delivery operations are complex, and the conventional way of using a single mode of delivery (e.g. driving) is not necessarily an efficient strategy. This paper describes a two-level parcel distribution model that combines walking and driving for a single driver. The model aims to minimise the total travelling time by scheduling a vehicle's routing and the driver's walking sequence when making deliveries, taking decisions on parking locations into consideration. The model is a variant of the Clustered Travelling Salesman Problem with Time Windows, in which the sequence of visits within each cluster is required to form a closed tour. When applied to a case study of an actual vehicle round from a parcel carrier operating in London, savings of over 20% in the total operation time were returned over the current situation where 104 transactions from 99 consignees were being delivered to 57 stopping points

Understanding the Impact of E-commerce on Last-Mile Light Goods Vehicle Activity in Urban Areas: The Case of London

Growth in e-commerce has led to increasing use of light goods vehicles for parcel deliveries in urban areas. This paper provides an insight into the reasons behind this growth and the resulting effort required to meet the exacting delivery services offered by e-retailers which often lead to poor vehicle utilisation in the last-mile operation, as well as the duplication of delivery services in urban centres as competitors vie for business. A case study investigating current parcel delivery operations in central London identified the scale of the challenge facing the last-mile parcel delivery driver, highlighting the importance of walking which can account for 62% of the total vehicle round time and 40% of the total round distance in the operations studied. The characteristics of these operations are in direct conflict with the urban infrastructure which is being increasingly redesigned in favour of walking, cycling and public transport, reducing the kerbside accessibility for last-mile operations. The paper highlights other pressures on last-mile operators associated with managing seasonal peaks in demand; reduced lead times between customers placing orders and deliveries being made; meeting delivery time windows; first-time delivery failure rates and the need to manage high levels of product returns. It concludes by describing a range of initiatives that retailers and parcel carriers, sometimes in conjunction with city authorities, can implement to reduce the costs associated with last-mile delivery, without negatively impacting on customer service levels

Quantifying environmental and financial benefits of using porters and cycle couriers for last-mile parcel delivery

Parcel carriers face increasingly difficult operating conditions in busy metropolitan areas due to growing consumer demand for ever faster delivery services and having to cope with traffic congestion and city authority measures that may restrict or penalise access for certain types of vehicle. This paper evaluates the potential environmental and financial benefits of switching from traditional van-based deliveries to an alternative operating model, where porters or cycle couriers undertake deliveries supported by a substantially reduced van fleet. Results using a specially-developed algorithm to model operations of a real carrier in an area of central London, UK, suggested that the carrier could reduce CO2 emissions by 45%, NOx emissions by 33%, driving distance by 78% and curbside parking time by 45%. Overall cost savings to the carrier were estimated to be in the range 34–39%. Scaling up the modelled emissions savings to London’s Central Activities Zone, an area of approximately 30 km2 and with current total annual parcel delivery distance of around 15 million km, could see annual emissions savings in the region of 2 million kg CO2 and 1633 kg NOx if all carriers utilised porters or cycle couriers. The key operating challenges identified were related to sorting and consolidating items by weight and volume, parcel handover arrangements and how to deal with express items and failed deliveries